Some Inequalities in Distance-Regular Graphs
نویسندگان
چکیده
منابع مشابه
Spectral Characterizations of Some Distance-Regular Graphs
When can one see from the spectrum of a graph whether it is distance-regular or not? We give some new results for when this is the case. As a consequence we find (among others) that the following distance-regular graphs are uniquely determined by their spectrum: The collinearity graphs of the generalized octagons of order (2, 1), (3, 1) and (4, 1), the Biggs-Smith graph, the M22 graph, and the ...
متن کاملSome Notes on Distance-Transitive and Distance-Regular Graphs
These are notes from lectures given in the Queen Mary Combinatorics Study 1 Introductory Definitions In these notes, Γ = (V Γ, EΓ) denotes a graph, as we will use G to denote a group. All graphs considered will be simple, finite, connected and undirected. Definition An automorphism of Γ is a bijective function g : V Γ → V Γ such that v ∼ w if and only if g(v) ∼ g(w). The set of all automorphism...
متن کاملEdge-distance-regular graphs are distance-regular
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph Γ is distance-regular and homogeneous. More precisely, Γ is edge-distance-regular if and only if it is bipartite distance-reg...
متن کاملShilla distance-regular graphs
A Shilla distance-regular graph Γ (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divides k for a Shilla distance-regular graph Γ, and for Γ we define b = b(Γ) := k a3 . In this paper we will show that there are finitely many Shilla distance-regular graphs Γ with fixed b(Γ) ≥ 2. Also, we will classify Sh...
متن کاملDistance mean-regular graphs
We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. A graph Γ = (V,E) with diameter D is distance meanregular when, for given u ∈ V , the averages of the intersection numbers ai(u, v), bi(u, v), and ci(u, v) (defined as usual), computed over all vertices v at distance i = 0, 1, . . . , D from u, do...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1993
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1041